Exploring Real Mobility Data with M%2DAtlas.

Advanced knowledge discovery on movement data with the GeoPKDD system.

As Time Goes by Discovering Eras in Evolving Social Networks.

Hiding Sequential and Spatiotemporal Patterns.

Movement Data Anonymity through Generalization.

Social Network Analysis as Knowledge Discovery Process A Case Study on Digital Bibliography.

Mining Mobility Behavior from Trajectory Data.

Geographic privacy%2Daware knowledge discovery and delivery.
In this report, we summarize the events of the First International
Trajectory pattern analysis for urban traffic.

High Quality True%2DPositive Prediction for Fiscal Fraud Detection.

Mining the Temporal Dimension of the Information Propagation.

Temporal mining for interactive workflow data analysis.

WhereNext a location predictor on trajectory pattern mining.


Mining the Information Propagation in a Network.


SNIPER A Data Mining Methodology for Fiscal Fraud Detection.

A constraint%2Dbased querying system for exploratory pattern discovery.

Mobility%2C Data Mining and Privacy %2D Geographic Knowledge Discovery

The DAEDALUS framework progressive querying and mining of movement data.

Clustering of German municipalities based on mobility characteristics an overview of results.


Location prediction within the mobility data analysis environment DAEDALUS.


DAEDALUS A knowledge discovery analysis framework for movement data.

Temporal analysis of process logs a case study.

Mobility%2C Data Mining and Privacy A Vision of Convergence.


Querying and Reasoning for Spatiotemporal Data Mining.


Visually driven analysis of movement data by progressive clustering.

Mining Clinical Data with a Temporal Dimension A Case Study.

Hiding Sequences.
This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a C-like imperative language) to PowerPC assembly code, using the Coq proof assistant both for programming the compiler and for proving its correctness. Such a certified compiler is useful in the context of formal methods applied to the certification of critical software: the certification of the compiler guarantees that the safety properties proved on the source code hold for the executable compiled code as well.  
Time%2DAnnotated Sequences for Medical Data Mining.

Hiding Sensitive Trajectory Patterns.
Abstract. Sequential pattern mining is a major research field in knowledge discovery and data mining. Thanks to the increasing availability of transaction data, it is now possible to provide new and improved services based on users ’ and customers ’ behavior. However, this puts the citizen’s privacy at risk. Thus, it is important to develop new privacy-preserving data mining techniques that do not alter the analysis results significantly. In this paper we propose a new approach for anonymizing sequential data by hiding infrequent, and thus potentially sensible, subsequences. Our approach guarantees that the disclosed data are k-anonymous and preserve the quality of extracted patterns. An application to a real-world moving object database is presented, which shows the effectiveness of our approach also in complex contexts. 1
Trajectory pattern mining.
The constant increase of moving object data imposes the need for modeling, processing, and mining trajectories, in order to find and understand the patterns behind these data. Existing works have mainly focused on the geometric properties of trajectories, while the semantics and the background geographic information has rarely been addressed. We claim that meaningful patterns can only be extracted from trajectories if the geographic space where trajectories are located is considered. In this paper we propose a reverse engineering framework for mining and modeling semantic trajectory patterns. Since trajectory patterns are data dependent, they may not be modeled in conceptual geographic database schemas before they are known. Therefore, we apply data mining to extract general trajectory patterns, and through a new kind of relationships, we model these patterns in the geographic database schema. A case study shows the power of the framework for modeling semantic trajectory patterns in the geographic space.
Privacy%2DAware Knowledge Discovery from Location Data.

Privacy%2DAware Knowledge Discovery from Location Data.

Hiding Sequences.
This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a C-like imperative language) to PowerPC assembly code, using the Coq proof assistant both for programming the compiler and for proving its correctness. Such a certified compiler is useful in the context of formal methods applied to the certification of critical software: the certification of the compiler guarantees that the safety properties proved on the source code hold for the executable compiled code as well.  
Towards Constraint%2DBased Subgraph Mining.

Mining HLA Patterns Explaining Liver Diseases.

ConQueSt a Constraint%2Dbased Querying System for Exploratory Pattern Discovery.

On Interactive Pattern Mining from Relational Databases.
Clustering is an important tool for data mining, since it can  identify major patterns or trends without any supervision (labeled data).
On Interactive Pattern Mining from Relational Databases.
Clustering is an important tool for data mining, since it can  identify major patterns or trends without any supervision (labeled data).
Towards low%2Dperturbation anonymity preserving pattern discovery.

Mining sequences with temporal annotations.
In this paper we propose an extension of the sequence mining paradigm to (temporally-)annotated sequential patterns, where each transition in a sequential pattern is annotated with a typical transition time derived from the source data. Then, we present a basic solution for the novel mining problem based on the combination of sequential pattern mining and clustering, and assess this solution on two realistic datasets, illustrating how potentially useful patterns of the new form are extracted. 1.
Efficient Mining of Temporally Annotated Sequences.

On Interactive Pattern Mining from Relational Databases.
Clustering is an important tool for data mining, since it can  identify major patterns or trends without any supervision (labeled data).
Synthetic generation of cellular network positioning data.

Synthetic generation of cellular network positioning data.

Blocking Anonymity Threats Raised by Frequent Itemset Mining.
In this paper we study when the disclosure of data mining results represents, per se, a threat to the anonymity of the individuals recorded in the analyzed database. The novelty of our approach is that we focus on an objective definition of privacy compliance of patterns without any reference to a preconceived knowledge of what is sensitive and what is not, on the basis of the rather intuitive and realistic constraint that the anonymity of individuals should be guaranteed. In particular, the problem addressed here arises from the possibility of inferring from the output of frequent itemset mining (i.e., a set of itemsets with support larger than a threshold σ), the existence of patterns with very low support (smaller than an anonymity threshold k)[3]. In the following we develop a simple methodology to block such inference opportunities by introducing distortion on the dangerous patterns. 1.
k%2DAnonymous Patterns.
Abstract. It is generally believed that data mining results do not violate the anonymity of the individuals recorded in the source database. In fact, data mining models and patterns, in order to ensure a required statistical significance, represent a large number of individuals and thus conceal individual identities: this is the case of the minimum support threshold in association rule mining. In this paper we show that this belief is ill-founded. By shifting the concept of k-anonymity from data to patterns, we formally characterize the notion of a threat to anonymity in the context of pattern discovery, and provide a methodology to efficiently and effectively identify all possible such threats that might arise from the disclosure of a set of extracted patterns. 1
Anonymity and data mining.
“Although nature commences with reason and ends with experience it is necessary for us to do the opposite, that is to commence with experience and from this to proceed to investigate the reason.” This thesis investigates two new research problems that arise in modern data mining: reasoning on data mining results, and privacy implication of data mining results. Most of the data mining algorithms rely on inductive techniques, trying to infer information that is generalized from the input data. But very often this inductive step on raw data is not enough to answer the user questions, and there is the need to process data again using other inference methods. In order to answer high level user needs such as explanation of results, we describe an environment able to perform abductive (hypothetical) reasoning, since often the solutions of such queries can be seen as the set of hypothesis that satisfy some requirements. By using cost-based abduction, we show how classification algorithms can be boosted by performing abductive reasoning over the data mining results, improving the quality
Exante A Preprocessing Method for Frequent%2DPattern Mining.

Efficient breadth%2Dfirst mining of frequent pattern with monotone constraints.

Machine Learning ECML 2004

Knowledge Discovery in Databases PKDD 2004

A Relational Query Primitive for Constraint%2DBased Pattern Mining.

Discovery of ads web hosts through traffic data analysis.

Towards a Logic Query Language for Data Mining.

Pushing Constraints to Detect Local Patterns.

Frequent Pattern Queries for Flexible Knowledge Discovery.

Specifying Mining Algorithms with Iterative User%2DDefined Aggregates.

ExAMiner Optimized Level%2Dwise Frequent Pattern Mining with Monotone Constraint.
The key point of this paper is that, in frequent pattern mining, the most appropriate way of exploiting monotone constraints in conjunction with frequency is to use them in order to reduce the problem input together with the search space. Following this intuition, we introduce ExAMiner, a level-wise algorithm which exploits the real synergy of antimonotone and monotone constraints: the total benefit is greater than the sum of the two individual benefits. ExAMiner generalizes the basic idea of the preprocessing algorithm ExAnte [4], embedding such ideas at all levels of an Apriori-like computation. The resulting algorithm is the generalization of the Apriori algorithm when a conjunction of monotone constraints is conjoined to the frequency antimonotone constraint. Experimental results confirm that this is, so far, the most efficient way of attacking the computational problem in analysis.
Logical Languages for Data Mining.

Adaptive Constraint Pushing in Frequent Pattern Mining.
Abstract. Pushing monotone constraints in frequent pattern mining can help pruning the search space, but at the same time it can also reduce the effectiveness of anti-monotone pruning. There is a clear tradeoff. Is it better to exploit more monotone pruning at the cost of less antimonotone pruning, or viceversa? The answer depends on characteristics of the dataset and the selectivity of constraints. In this paper, we deeply characterize this trade-off and its related computational problem. As a result of this characterization, we introduce an adaptive strategy, named ACP (Adaptive Constraint Pushing) which exploits any conjunction of monotone and anti-monotone constraints to prune the search space, and level by level adapts the pruning to the input dataset and constraints, in order to maximize efficiency. 1
ExAnte Anticipated Data Reduction in Constrained Pattern Mining.
Constraint pushing techniques have been proven to be e#ective  in reducing the search space in the frequent pattern mining task,  and thus in improving e#ciency. But while pushing anti-monotone constraints  in a level-wise computation of frequent itemsets has been recognized  to be always profitable, the case is di#erent for monotone constraints.
WebCat Automatic Categorization of Web Search Results.

Pre%2Dprocessing for Constrained Pattern Mining.

Characterizing Web User Accesses A Transactional Approach to Web Log Clustering.

LDL%2DMine Integrating Data Mining with Intelligent Query Answering.

Invited talk Logical Data Mining Query Languages.

Invited talk Logical Data Mining Query Languages.

Clustering Transactional Data.
It is widely recognized that developing efficient and fully automated algorithms for clustering large transactional datasets is a challenging problem. In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the concept of Weighted Coverage Density as a categorical similarity measure for efficient clustering of transactional datasets. The concept of weighted coverage density is intuitive and allows the weight of each item in a cluster to be changed dynamically according to the occurrences of items. Second, we develop two transactional data clustering specific evaluation metrics based on the concept of large transactional items and the coverage density respectively. Third, we implement the weighted coverage density clustering algorithm and the two clustering validation metrics using a fully automated transactional clustering framework, called SCALE (Sampling, Clustering structure Assessment, cLustering and domain-specific Evaluation). The SCALE framework is designed to combine the weighted coverage density measure for clustering over a sample dataset with self-configuring methods that can automatically tune the two important parameters of the clustering algorithms: (1) the candidates of the best number K of clusters; and (2) the application of two domain-specific cluster validity measures to find the best result from the set of clustering results. We have conducted experimental evaluation using both synthetic and real datasets and our results show that the weighted coverage-density approach powered by the SCALE framework can efficiently generate high quality clustering results in a fully automated manner.
Clustering Transactional Data.
It is widely recognized that developing efficient and fully automated algorithms for clustering large transactional datasets is a challenging problem. In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the concept of Weighted Coverage Density as a categorical similarity measure for efficient clustering of transactional datasets. The concept of weighted coverage density is intuitive and allows the weight of each item in a cluster to be changed dynamically according to the occurrences of items. Second, we develop two transactional data clustering specific evaluation metrics based on the concept of large transactional items and the coverage density respectively. Third, we implement the weighted coverage density clustering algorithm and the two clustering validation metrics using a fully automated transactional clustering framework, called SCALE (Sampling, Clustering structure Assessment, cLustering and domain-specific Evaluation). The SCALE framework is designed to combine the weighted coverage density measure for clustering over a sample dataset with self-configuring methods that can automatically tune the two important parameters of the clustering algorithms: (1) the candidates of the best number K of clusters; and (2) the application of two domain-specific cluster validity measures to find the best result from the set of clustering results. We have conducted experimental evaluation using both synthetic and real datasets and our results show that the weighted coverage-density approach powered by the SCALE framework can efficiently generate high quality clustering results in a fully automated manner.
Data Mining for Intelligent Web Caching.
The paper presents a vertical application of data warehousing and data mining technology:  intelligent web caching. We introduce several ways to construct intelligent web  caching algorithms that employ predictive models of web requests; the general idea is to  extend the LRU policy of web and proxy servers by making it sensible to web access models  extracted from web log data using data mining techniques. Two approaches have been  studied in particular, one based on association rules and another based on decision trees.
Specifying Mining Algorithms with Iterative User%2DDefined Aggregates A Case Study.

Clustering Transactional Data.
It is widely recognized that developing efficient and fully automated algorithms for clustering large transactional datasets is a challenging problem. In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the concept of Weighted Coverage Density as a categorical similarity measure for efficient clustering of transactional datasets. The concept of weighted coverage density is intuitive and allows the weight of each item in a cluster to be changed dynamically according to the occurrences of items. Second, we develop two transactional data clustering specific evaluation metrics based on the concept of large transactional items and the coverage density respectively. Third, we implement the weighted coverage density clustering algorithm and the two clustering validation metrics using a fully automated transactional clustering framework, called SCALE (Sampling, Clustering structure Assessment, cLustering and domain-specific Evaluation). The SCALE framework is designed to combine the weighted coverage density measure for clustering over a sample dataset with self-configuring methods that can automatically tune the two important parameters of the clustering algorithms: (1) the candidates of the best number K of clusters; and (2) the application of two domain-specific cluster validity measures to find the best result from the set of clustering results. We have conducted experimental evaluation using both synthetic and real datasets and our results show that the weighted coverage-density approach powered by the SCALE framework can efficiently generate high quality clustering results in a fully automated manner.
Complex Reasoning on Geographical Data.
This article describes our implementation in Answer Set Programming  of a reasoning system that models the flow of lava in volcanic  eruptions. Our system can be employed in the validation of evacuation  plans. To demonstrate the feasibility of such approach, we adopt a simplified  yet realistic model of how lava flows, and apply it to altitude data  from the Etna volcano.
Web log data warehousing and mining for intelligent web caching.
We introduce intelligent web caching algorithms that employ predictive models of web requests; the general idea is to extend the LRU policy of web and proxy servers by making it sensible to web access models extracted from web log data using data mining techniques. Two approaches have been studied in particular, frequent patterns and decision trees. The experimental results of the new algorithms show substantial improvement over existing LRU-based caching techniques, in terms of hit rate. We designed and developed a prototypical system, which supports data warehousing of web log data, extraction of data mining models and simulation of the web caching algorithms.
Nondeterministic%2C Nonmonotonic Logic Databases.
We consider in this paper an extension of Datalog with mechanisms for temporal, nonmonotonic and nondeterministic reasoning, which we refer to as Datalog++. We show, by means of examples, its flexibility in expressing queries concerning aggregates and data cube. Also, we show how iterated fixpoint and stable model semantics can be combined to the purpose of clarifying the semantics of Datalog++ programs, and supporting their efficient execution. Finally, we provide a more concrete implementation strategy, on which basis the design of optimization techniques tailored for Datalog++ is addressed.
Semantics and Expressive Power of Nondeterministic Constructs in Deductive Databases.

On Verification in Logic Database Languages.

Logic%2DBased Knowledge Discovery in Databases.
this paper, are extensively studied in [2, 4, 5, 10]
Declarative Knowledge Extraction with Interactive User%2DDefined Aggregates.


Making Knowledge Extraction and Reasoning Closer.


Experiences with a Logic%2DBased Knowledge Discovery Support Environment.

Querying inductive Databases via Logic%2DBased user%2Ddefined aggregates.


Beyond Current Technology The Perspective of Three EC GIS Projects.

Using Data Mining Techniques in Fiscal Fraud Detection.
. Planning adequate audit strategies is a key success factor in &#034;a  posteriori&#034; fraud detection, e.g., in the fiscal and insurance domains, where  audits are intended to detect tax evasion and fraudulent claims. A case study is  presented in this paper, which illustrates how techniques based on classification  can be used to support the task of planning audit strategies. The proposed  approach is sensible to some conflicting issues of audit planning, e.g., the tradeoff  between maximizing audit benefits vs. minimizing audit costs.  1 Introduction  Fraud detection is becoming a central application area for knowledge discovery in databases, as it poses challenging technical and methodological problems, many of which are still open [1, 2]. A major task in fraud detection is that of constructing models, or profiles, of fraudulent behavior, which may serve in decision support systems for:  . preventing frauds (a priori fraud detection), or  . planning audit strategies (a posteriori fraud de...

Querying Inductive Databases via Logic%2DBased User%2DDefined Aggregates.

Integration of Deduction and Induction for Mining Supermarket Sales Data.

Una Metodologia Basata sulla Classificazione per la Pianificazione degli Accertamenti nel Rilevamento di Frodi.

On the Effective Semantics of Nondeterministic
We consider in this paper an extension of Datalog with mechanisms for temporal, nonmonotonic and nondeterministic reasoning, which we refer to as Datalog++. We study its semantics, and show how iterated fixpoint and stable model semantics can be combined to the purpose of clarifying the interpretation of Datalog++ programs, and supporting their efficient execution. On this basis, the design of appropriate optimization techniques for Datalog++ is also discussed.
Query Answering in Nondeterministic%2C Nonmonotonic Logic Databases.

Datalog with Non%2DDeterministic Choice Computers NDB%2DPTIME.

A Deductive Data Model for Representing and Querying Semistructured Data.
We show how the mechanisms of an active/deductive object-oriented model are capable of modeling the information available on the World Wide Web, the paradigmatic example of a large, distributed collection of poorly structured, heterogeneous information, consisting of documents connected by hypertext links. We exhibit the basic features of the object model, including the schema definition language, the query language with multiple roles, the basic update operations, and a form of active rules, and a compilation of the mentioned features into a fragment of  LDL++, which is essentially Datalog extended with non-determinism and a form of stratified negation. The proposed compilation has a twofold aim. On one side, it should provide an abstract implementation level, where the object model is declaratively reconstructed and its semantics clarified. On the other side, the proposed compilation should form the basis of a realistic implementation, as LDL++ can be efficiently executed, and suppor...
Static Analysis of Transactions for Conservative Multigranularity Locking.

Datalog   A Basis for Active Object%2DOriented Databases.
We consider in this paper an extension of Datalog with mechanisms for temporal, non monotonic and non deterministic reasoning, which we refer to as Datalog++. First, we study its semantics, and show how iterated fixpoint and stable model semantics can be combined to the purpose of clarifying the interpretation of Datalog++ programs, and supporting their efficient execution. Second, we exhibit a compilation into Datalog++ of an active/deductive object-oriented model, ADOOD, including the schema definition language, the query language with multiple roles, the basic update operations, and a form of active rules. The proposed compilation is intended both to illustrate the expressiveness of Datalog++, and to provide a more flexible programming front-end to it. Finally, we illustrate the use of ADOOD by means of examples from semistructured data management.
Datalog   a Basis for Active Object.Oriented Databases.
We consider in this paper an extension of Datalog with mechanisms for temporal, non monotonic and non deterministic reasoning, which we refer to as Datalog++. First, we study its semantics, and show how iterated fixpoint and stable model semantics can be combined to the purpose of clarifying the interpretation of Datalog++ programs, and supporting their efficient execution. Second, we exhibit a compilation into Datalog++ of an active/deductive object-oriented model, ADOOD, including the schema definition language, the query language with multiple roles, the basic update operations, and a form of active rules. The proposed compilation is intended both to illustrate the expressiveness of Datalog++, and to provide a more flexible programming front-end to it. Finally, we illustrate the use of ADOOD by means of examples from semistructured data management.
Programming with Non%2DDeterminism in Deductive Databases.
This paper provides an overview of recent results on this topic with the aim of providing an introduction to the theory and practice of non-determinism in deductive databases. In particular we (i) recall the main results linking non-deterministic constructs in database languages to the theory of data complexity and the expressibility hierarchy of query languages (ii) provide a reasoned introduction to effective programming with nondeterministic constructs (iii) compare the usage of non-deterministic constructs in languages such as
Programming with Non%2DDeterminism in Deductive Databases.
This paper provides an overview of recent results on this topic with the aim of providing an introduction to the theory and practice of non-determinism in deductive databases. In particular we (i) recall the main results linking non-deterministic constructs in database languages to the theory of data complexity and the expressibility hierarchy of query languages (ii) provide a reasoned introduction to effective programming with nondeterministic constructs (iii) compare the usage of non-deterministic constructs in languages such as
Spatio%2DTemporal Reasoning with LDLT First Steps Towards a Deductive System for Geographical Applications.
In this paper we describe our experiment using an extension of the deductive database system LDL ++ [AOTZ93, AOZ93, AO93] to express situations that need spatio-temporal reasoning in Sea monitoring. The temporal extension we used is LDLT [DM94], a temporal database proposal that integrates the expressiveness and deductive power of the logic language LDL [NT88] with the possibility to perform temporal reasoning based on the Interval Algebra by Allen [All83]. The aim of our work is to realize an efficient integration between Deductive Databases and Geographical Information Systems (GIS) to study the advantages that the integration can bring to both of them. We want to understand, from one side, the adaptability and the contribution that Deductive Databases technology can give to GIS and from the other side, which kind of temporal reasoning GIS need or which applications GIS are addressed to. In particular, using the Sea monitoring application problem, it can be seen how a minimal tempora...
Ragionamento spazio%2Dtemporale con LDLT primi esperimenti verso un sistema deduttivo per applicazioni geografiche.

Declarative Reconstruction of Updates in Logic Databases a Compilative Approach.

Declarative Reconstruction of Updates in Logic Databases A Compilative Approach.

An abstract interpreter for the specification language LOTOS.

Conservative Multigranularity Locking for an Obiect%2DOriented Persistent Language via Abstract Interpretation.

Expressive Power of Non%2DDeterministic Operators for Logic%2Dbased Languages.
Non-deterministic operators are needed in First-Order relational languages and Datalog to extend the expressive power of such languages and support efficient formulations of low complexity problems. In this paper, we study the operators proposed in the literature, including witness, lazy choice and dynamic choice, and compare their power of expressing deterministic and non-deterministic queries. We obtain a simple hierarchy that relates these operators with each other and with other constructs, such as negation and fixpoint.
Gate Splitting in LOTOS Specifications Using Abstract Interpretation.

Datalog with Non%2DDeterministic Choice Computes NDB%2DPTIME.

Static Analysis of Transactions an Experiment of Abstract Interpretation Usage.

Gate Splitting in LOTOS Specifications Using Abstract Interpretation.

Data Sharing Analysis for a Database Programming Lanaguage via Abstract Interpretation.

Analysis of Concurrent Transactions in a Functional Database Programming Language.

Using Abstract Interpretation for Gate splitting in LOTOS Specifications.

Non%2DDeterminism in Deductive Databases.
This paper examines the problem of adding non-deterministic constructs to a declarative database language based on Horn Clause Logic. We revise a previously proposed approach, the choice construct introduced by Krishnamurthy and Naqvi, from the viewpoints of amenability to efficient implementation and expressive power.
A Technique for Recursive Invariance Detection and Selective Program Specification.

RASP A Resource Allocator for Software Projects.

Declarative Semantics for Pruning Operators in Logic Programming.
Stable models, a concept from autoepistemic logic, have been recently proposed  to define the semantics of logic programs with negation. A program  may have several stable models, and this multiplicity can be exploited to  characterize &#034;on&#039;t care&#034; nondeterminism, such as that arising from pruning  operators. In the (bottom-up) context of deductive databases, a semantics for  the nondeterministic choice construct was given by Sacca and Zaniolo. In  this paper, we extend their approach to handle the cut-tike pruning operators  in the top-down evaluation context, including the one-of and commit operators.
Symbolic Evaluation with Structural Recursive Symbolic Constants.

The Type System of Galileo.

The Type System of Galileo.

Symbolic Semantics and Program Reduction.

